Broadcasting and NP - completeness
نویسنده
چکیده
In this note, we answer two questions arising in broadcasting problems in networks. We rst describe a new family of minimum broadcast graphs. Then we give a proof due to Alon of the NP-completeness of nding disjoint spanning trees of minimum depth, rooted at a given vertex.
منابع مشابه
The complexity of broadcasting in bounded-degree networks
Because of cost and physical limitations there is an interest in broadcast networks with a fixed maximum number of communication links for each node, [BHLP,LP,DFF]. In this note we show that given an arbitrary bounded-degree network, determining the minimum broadcast time for any originating node is NPcomplete. For the NP-completeness proof of the general case of unbounded-degree networks, it i...
متن کاملApproximation algorithms for information dissemination problems
Broadcasting and gossiping are known to be NP hard problems This paper deals with approximation algorithms for such problems We consider both round complexity and step complexity in the telephone model After an overview of previously derived approximation algorithms we present new strategies for broadcasting and gossiping in any graphs Broadcasting strategies are based on the construction of ed...
متن کاملA New Heuristic for Broadcasting in Cluster of Clusters
This paper deals with the problem of broadcasting for cluster of clusters. The construction of partial minimum spanning trees being NP-complete, several heuristic algorithms have been already formulated. Many of these heuristics (like the heuristic of Kruskal) use the shortest path to connect the components of the tree. They are not relevant in case of forwarding or overlapping communication du...
متن کاملA new heuristic for broadcasting in clusters of clusters
This paper deals with the problem of broadcasting for cluster of clusters. The construction of partial minimum spanning trees being NP-complete, several heuristic algorithms have been already formulated. Many of these heuristics (like the heuristic of Kruskal) use the shortest path to connect the components of the tree. They are not relevant in case of forwarding or overlapping communication du...
متن کاملBroadcasting in Conflict-Aware Multi-channel Networks
The broadcasting problem asks for the fastest way of transmitting a message to all nodes of a communication network. We consider the broadcasting problem in conflictaware multi-channel networks. These networks can be modeled as undirected graphs in which each edge is labeled with a set of available channels to transmit data between its endpoints. Each node can send and receive data through any ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007